Step of Proof: bor_wf
9,38
postcript
pdf
Inference at
*
I
of proof for Lemma
bor
wf
:
p
,
q
:
. (
p
q
)
latex
by ((Unfold `bor` 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
.
Definitions
p
q
,
t
T
,
x
:
A
.
B
(
x
)
Lemmas
bool
wf
,
btrue
wf
,
ifthenelse
wf
origin